TSTP Solution File: DAT280^1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : DAT280^1 : TPTP v8.1.2. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n009.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 05:06:20 EDT 2024
% Result : Theorem 0.20s 0.38s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 20
% Syntax : Number of formulae : 27 ( 9 unt; 17 typ; 0 def)
% Number of atoms : 56 ( 10 equ; 0 cnn)
% Maximal formula atoms : 2 ( 5 avg)
% Number of connectives : 8 ( 7 ~; 0 |; 0 &; 0 @)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 48 ( 47 >; 1 *; 0 +; 0 <<)
% Number of symbols : 17 ( 15 usr; 2 con; 0-7 aty)
% Number of variables : 42 ( 0 ^ 22 !; 10 ?; 42 :)
% ( 10 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(type_def_6,type,
'type/ind_types/list': $tType > $tType ).
thf(type_def_7,type,
sK0: $tType ).
thf(type_def_8,type,
sK1: $tType ).
thf(type_def_9,type,
sK2: $tType ).
thf(func_def_0,type,
'type/ind_types/list': $tType > $tType ).
thf(func_def_1,type,
'const/lists/ITLIST2':
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( X0 > X1 > X2 > X2 ) > 'type/ind_types/list'(X0) > 'type/ind_types/list'(X1) > X2 > X2 ) ).
thf(func_def_2,type,
'const/ind_types/NIL':
!>[X0: $tType] : 'type/ind_types/list'(X0) ).
thf(func_def_6,type,
sK3: sK0 > sK1 > sK2 > sK2 ).
thf(func_def_7,type,
sK4: sK2 ).
thf(func_def_8,type,
kCOMB:
!>[X0: $tType,X1: $tType] : ( X0 > X1 > X0 ) ).
thf(func_def_9,type,
bCOMB:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( X1 > X2 ) > ( X0 > X1 ) > X0 > X2 ) ).
thf(func_def_10,type,
vAND: $o > $o > $o ).
thf(func_def_11,type,
vOR: $o > $o > $o ).
thf(func_def_12,type,
vIMP: $o > $o > $o ).
thf(func_def_13,type,
vNOT: $o > $o ).
thf(func_def_14,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(f44,plain,
$false,
inference(trivial_inequality_removal,[],[f43]) ).
thf(f43,plain,
sK4 != sK4,
inference(superposition,[],[f9,f10]) ).
thf(f10,plain,
! [X1: $tType,X0: $tType,X2: $tType,X3: X0 > X1 > X2 > X2,X4: 'type/ind_types/list'(X1),X5: X2] : ( vAPP(X2,X2,vAPP('type/ind_types/list'(X1),sTfun(X2,X2),vAPP('type/ind_types/list'(X0),sTfun('type/ind_types/list'(X1),sTfun(X2,X2)),vAPP(sTfun(X0,sTfun(X1,sTfun(X2,X2))),sTfun('type/ind_types/list'(X0),sTfun('type/ind_types/list'(X1),sTfun(X2,X2))),'const/lists/ITLIST2'(X0,X1,X2),X3),'const/ind_types/NIL'(X0)),X4),X5) = X5 ),
inference(cnf_transformation,[],[f1]) ).
thf(f1,axiom,
! [X0: $tType,X1: $tType,X2: $tType,X3: X0 > X1 > X2 > X2,X4: 'type/ind_types/list'(X1),X5: X2] : ( vAPP(X2,X2,vAPP('type/ind_types/list'(X1),sTfun(X2,X2),vAPP('type/ind_types/list'(X0),sTfun('type/ind_types/list'(X1),sTfun(X2,X2)),vAPP(sTfun(X0,sTfun(X1,sTfun(X2,X2))),sTfun('type/ind_types/list'(X0),sTfun('type/ind_types/list'(X1),sTfun(X2,X2))),'const/lists/ITLIST2'(X0,X1,X2),X3),'const/ind_types/NIL'(X0)),X4),X5) = X5 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/lists/ITLIST2_DEF_0') ).
thf(f9,plain,
sK4 != vAPP(sK2,sK2,vAPP('type/ind_types/list'(sK1),sTfun(sK2,sK2),vAPP('type/ind_types/list'(sK0),sTfun('type/ind_types/list'(sK1),sTfun(sK2,sK2)),vAPP(sTfun(sK0,sTfun(sK1,sTfun(sK2,sK2))),sTfun('type/ind_types/list'(sK0),sTfun('type/ind_types/list'(sK1),sTfun(sK2,sK2))),'const/lists/ITLIST2'(sK0,sK1,sK2),sK3),'const/ind_types/NIL'(sK0)),'const/ind_types/NIL'(sK1)),sK4),
inference(cnf_transformation,[],[f8]) ).
thf(f8,plain,
sK4 != vAPP(sK2,sK2,vAPP('type/ind_types/list'(sK1),sTfun(sK2,sK2),vAPP('type/ind_types/list'(sK0),sTfun('type/ind_types/list'(sK1),sTfun(sK2,sK2)),vAPP(sTfun(sK0,sTfun(sK1,sTfun(sK2,sK2))),sTfun('type/ind_types/list'(sK0),sTfun('type/ind_types/list'(sK1),sTfun(sK2,sK2))),'const/lists/ITLIST2'(sK0,sK1,sK2),sK3),'const/ind_types/NIL'(sK0)),'const/ind_types/NIL'(sK1)),sK4),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f6,f7]) ).
thf(f7,plain,
( ? [X0: $tType,X1: $tType,X2: $tType,X3: X0 > X1 > X2 > X2,X4: X2] : ( vAPP(X2,X2,vAPP('type/ind_types/list'(X1),sTfun(X2,X2),vAPP('type/ind_types/list'(X0),sTfun('type/ind_types/list'(X1),sTfun(X2,X2)),vAPP(sTfun(X0,sTfun(X1,sTfun(X2,X2))),sTfun('type/ind_types/list'(X0),sTfun('type/ind_types/list'(X1),sTfun(X2,X2))),'const/lists/ITLIST2'(X0,X1,X2),X3),'const/ind_types/NIL'(X0)),'const/ind_types/NIL'(X1)),X4) != X4 )
=> ( sK4 != vAPP(sK2,sK2,vAPP('type/ind_types/list'(sK1),sTfun(sK2,sK2),vAPP('type/ind_types/list'(sK0),sTfun('type/ind_types/list'(sK1),sTfun(sK2,sK2)),vAPP(sTfun(sK0,sTfun(sK1,sTfun(sK2,sK2))),sTfun('type/ind_types/list'(sK0),sTfun('type/ind_types/list'(sK1),sTfun(sK2,sK2))),'const/lists/ITLIST2'(sK0,sK1,sK2),sK3),'const/ind_types/NIL'(sK0)),'const/ind_types/NIL'(sK1)),sK4) ) ),
introduced(choice_axiom,[]) ).
thf(f6,plain,
? [X0: $tType,X1: $tType,X2: $tType,X3: X0 > X1 > X2 > X2,X4: X2] : ( vAPP(X2,X2,vAPP('type/ind_types/list'(X1),sTfun(X2,X2),vAPP('type/ind_types/list'(X0),sTfun('type/ind_types/list'(X1),sTfun(X2,X2)),vAPP(sTfun(X0,sTfun(X1,sTfun(X2,X2))),sTfun('type/ind_types/list'(X0),sTfun('type/ind_types/list'(X1),sTfun(X2,X2))),'const/lists/ITLIST2'(X0,X1,X2),X3),'const/ind_types/NIL'(X0)),'const/ind_types/NIL'(X1)),X4) != X4 ),
inference(ennf_transformation,[],[f3]) ).
thf(f3,negated_conjecture,
~ ! [X0: $tType,X1: $tType,X2: $tType,X3: X0 > X1 > X2 > X2,X4: X2] : ( vAPP(X2,X2,vAPP('type/ind_types/list'(X1),sTfun(X2,X2),vAPP('type/ind_types/list'(X0),sTfun('type/ind_types/list'(X1),sTfun(X2,X2)),vAPP(sTfun(X0,sTfun(X1,sTfun(X2,X2))),sTfun('type/ind_types/list'(X0),sTfun('type/ind_types/list'(X1),sTfun(X2,X2))),'const/lists/ITLIST2'(X0,X1,X2),X3),'const/ind_types/NIL'(X0)),'const/ind_types/NIL'(X1)),X4) = X4 ),
inference(negated_conjecture,[],[f2]) ).
thf(f2,conjecture,
! [X0: $tType,X1: $tType,X2: $tType,X3: X0 > X1 > X2 > X2,X4: X2] : ( vAPP(X2,X2,vAPP('type/ind_types/list'(X1),sTfun(X2,X2),vAPP('type/ind_types/list'(X0),sTfun('type/ind_types/list'(X1),sTfun(X2,X2)),vAPP(sTfun(X0,sTfun(X1,sTfun(X2,X2))),sTfun('type/ind_types/list'(X0),sTfun('type/ind_types/list'(X1),sTfun(X2,X2))),'const/lists/ITLIST2'(X0,X1,X2),X3),'const/ind_types/NIL'(X0)),'const/ind_types/NIL'(X1)),X4) = X4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/lists/ITLIST2_0') ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : DAT280^1 : TPTP v8.1.2. Released v7.0.0.
% 0.13/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.13/0.35 % Computer : n009.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri May 3 12:56:25 EDT 2024
% 0.13/0.36 % CPUTime :
% 0.13/0.36 % (7337)Running in auto input_syntax mode. Trying TPTP
% 0.20/0.37 % (7340)WARNING: value z3 for option sas not known
% 0.20/0.37 % (7344)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.20/0.37 % (7344)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.20/0.37 % (7341)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.20/0.37 % (7339)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.20/0.37 % (7338)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.20/0.37 % (7342)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.20/0.37 % (7340)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.20/0.37 % (7343)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.20/0.38 % Exception at run slice level
% 0.20/0.38 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.38 % Exception at run slice level
% 0.20/0.38 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.38 % Exception at run slice level
% 0.20/0.38 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.38 % (7344)First to succeed.
% 0.20/0.38 % (7344)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-7337"
% 0.20/0.38 % (7343)Also succeeded, but the first one will report.
% 0.20/0.38 % (7344)Refutation found. Thanks to Tanya!
% 0.20/0.38 % SZS status Theorem for theBenchmark
% 0.20/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.38 % (7344)------------------------------
% 0.20/0.38 % (7344)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.20/0.38 % (7344)Termination reason: Refutation
% 0.20/0.38
% 0.20/0.38 % (7344)Memory used [KB]: 769
% 0.20/0.38 % (7344)Time elapsed: 0.004 s
% 0.20/0.38 % (7344)Instructions burned: 5 (million)
% 0.20/0.38 % (7337)Success in time 0.017 s
%------------------------------------------------------------------------------